Solving Word Equations modulo Partial Commutations
نویسندگان
چکیده
منابع مشابه
Matching Modulo Associativity and Idempotency Is NP-Complete
We show that AI–matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete. Note: this is a full version of the paper [9] and a revision of [8].
متن کاملSolving a Class of Partial Differential Equations by Differential Transforms Method
In this work, we find the differential transforms of the functions $tan$ and $sec$, and then we applied this transform on a class of partial differential equations involving $tan$ and $sec$.
متن کاملHomotopy Perturbation Method and Aboodh Transform for Solving Nonlinear Partial Differential Equations
Here, a new method called Aboodh transform homotopy perturbation method(ATHPM) is used to solve nonlinear partial dierential equations, we presenta reliable combination of homotopy perturbation method and Aboodh transformto investigate some nonlinear partial dierential equations. The nonlinearterms can be handled by the use of homotopy perturbation method. The resultsshow the eciency of this me...
متن کاملSolving high-order partial differential equations in unbounded domains by means of double exponential second kind Chebyshev approximation
In this paper, a collocation method for solving high-order linear partial differential equations (PDEs) with variable coefficients under more general form of conditions is presented. This method is based on the approximation of the truncated double exponential second kind Chebyshev (ESC) series. The definition of the partial derivative is presented and derived as new operational matrices of der...
متن کاملOn the expected number of commutations in reduced words
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that nearly all positions in the reduced word are expected to support commutations. Finally, we calculate the asymptotic frequencies of commutations, consecutive n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 224 شماره
صفحات -
تاریخ انتشار 1999